Finite Groups that Admit Kantor Families

نویسنده

  • Stanley E. Payne
چکیده

The basic problem of interest in this note is: What finite groups G admit a Kantor family (i.e., 4-gonal family) of subgroups? We begin with a survey of the known examples (of the groups G, not of the Kantor families) and then pose the question of whether or not two specific examples are isomorphic. The two groups in question have order q and coexist for q = 3 ≥ 27. Our conjecture had been that they are not isomorphic. During the conference it was announced that indeed they are not isomorphic, but the proof will be published elsewhere. 1. What is a Kantor Family? In 1980 W. M. Kantor [Ka80] found a new recipe for the construction of finite generalized quadrangles (GQ). The chief ingredient of this recipe is a family of subgroups of a given group satisfying a pair of conditions that are readily translated into necessary and sufficient conditions for a certain coset geometry to be a finite GQ. In this note we are not concerned with the GQ per se, but only with the groups that admit these Kantor families, which we now describe. Let s and t be positive integers greater than 1, and let G be a group of order st. Let F be a family F = {Ai : 0 ≤ i ≤ t} of t+ 1 subgroups of G of order s for which the following condition is satisfied: K1. Ai ·Aj ∩Ak = {id} whenever i, j, k are distinct, 0 ≤ i, j, k ≤ t. Put Ω = ∪(Ai : 0 ≤ i ≤ t). Then for each i, 0 ≤ i ≤ t define a subset Ai of G by Ai = Ai ∪ (Aig : g ∈ G and Aig ∩ Ω = ∅)). Put F∗ = {Ai : 0 ≤ i ≤ t}. It follows that |Ai | = st for each i. If each Ai is actually a subgroup of G, then Ai ≤ Ai for all i and the following second condition of Kantor is also satisfied: K2. Ai ∩Aj = {id} whenever i 6= j, 0 ≤ i, j ≤ t.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal families of permutation groups

For several families F of finite transitive permutation groups it is shown that each finite group is isomorphic to a 2-point stabilizer of infinitely many members of F .

متن کامل

Every finite non-solvable group admits an oriented regular representation

In this paper we give a partial answer to a 1980 question of Lazslo Babai: “Which [finite] groups admit an oriented graph as a DRR?” That is, which finite groups admit an oriented regular representation (ORR)? We show that every finite non-solvable group admits an ORR, and provide a tool that may prove useful in showing that some families of finite solvable groups admit ORRs. We also completely...

متن کامل

Some local 1 y

This paper is a continuation of Kantor (4, 6] and Ronan [10]. We will construct finite and infinite 'geometries' admitting flag-transitive groups and having buildings as universal covers. The first building is that of {1+ (6, (Ji2); the remaining ones are new and strange. As in the aforementioned papers, our motivation is the search for finite geometries that strongly resemble buildings, and fo...

متن کامل

Isomorphisms of groups related to flocks

A truly fruitful way to construct finite generalized quadrangles is through the detection of Kantor families in the general 5-dimensional Heisenberg group H2(q) over some finite field Fq . All these examples are so-called “flock quadrangles”. Payne (Geom. Dedic. 32:93–118, 1989) constructed from the Ganley flock quadrangles the new Roman quadrangles, which appeared not to arise from flocks, but...

متن کامل

Small Base Groups, Large Base Groups and the Case of Giants

Let G be a finite permutation group acting on a set Γ. A base for G is a finite sequence of elements of Γ whose pointwise stabiliser in G is trivial. Most (families of) finite permutation groups admit a base that grows very slowly as the degree of the group increases. Such groups are known as small base and very efficient algorithms exist for dealing with them. However, some families of permuta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005